package org.nowcoder.leetcode.prefixSum;

/**
 * Title  : 523. Continuous Subarray Sum
 * Source : https://leetcode.cn/problems/continuous-subarray-sum
 * Author : XrazYang
 * Date   : 2024-05-16
 */

public class LeetCode_523 {
    public boolean checkSubarraySum(int[] nums, int k) {
        //特殊情况处理
        if (nums.length < 2) return false;
        //滑动窗口
        int l = 0, r = 0;
        int sum = 0;
        while (l <= r) {
            int i = nums[r];
            sum += i;
            if (r - l >= 1) { //至少包含两个元素
            }
        }

        return false;
    }
}
